The Lattice of Subsemilattices of a Semilattice

نویسندگان

  • Leonid Libkin
  • Ilya Muchnik
چکیده

This note makes two observations about lattices of subsemilattices. First, we establish relationship between direct decompositions of such lattices and ordinal sum decompositions of semilattices. Then we give a characterization of the subsemilattice-lattices. Let us recall some terminology. L will always stand for a semilattice, whose operation will be denoted by. a of an arbitrary lattice L is called neutral if m(a; x; y) = M(a; x; y) for all x; y 2 L, where m(a; x; y) = (a ^ x) _ (a ^ y) _ (x ^ y) and M(a; x; y) = (a _ x) ^ (a _ y) ^ (x _ y). Notice that m(a; x; y) M(a; x; y) holds in any lattice. Lemma 1 Let L be a semilattice and L 0 its subsemilattice. Then L 0 is a neutral element of Sub L ii L ? L 0 is a subsemilattice of L and every element of L 0 is comparable with every element of L ? L 0. Proof. Let L 0 be a subsemilattice of L such that L ? L 0 is a subsemilattice of L as well and every element of L 0 is comparable with every element of L ? L 0. We must prove that, for any

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Length of Chains in Algebraic Lattices

We study how the existence in an algebraic lattice L of a chain of a given type is reflected in the join-semilattice K(L) of its compact elements. We show that for every chain α of size κ, there is a set B of at most 2 join-semilattices, each one having a least element such that an algebraic lattice L contains no chain of order type I(α) if and only if the join-semilattice K(L) of its compact e...

متن کامل

A characterization of well-founced algebraic lattices

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice L is well-founded if and only if K(L), the join-semilattice of compact elements of L, is well-founded and contains neither [ω], nor Ω(ω∗) as a join-subsemilattice. As an immediate corollary, we get that...

متن کامل

Intervals in Lattices of -Meet-Closed Subsets

We study abstract properties of intervals in the complete lattice of all meet-closed subsets ( -subsemilattices) of a -(meet-)semilattice S, where is an arbitrary cardinal number. Any interval of that kind is an extremally detachable closure system (that is, for each closed set A and each point x outside A, deleting x from the closed set generated by A and x leaves a closed set). Such closure s...

متن کامل

Nuclei of Monotonic Systems on a Semilattice of Sets

I. B. Muchnik and L. V. Shvartser UDC 519.876 Algorithms developed in the method of monotonic systems for the identification of extremal subsets are modified for the analysis of the condition of an arbitrary finite semilattice of sets. We show how to generate these subsemilattices in a goal-directed manner in the form of solutions of systems of inequalities defined by a collection of monotonic ...

متن کامل

SOME INTUITIONISTIC FUZZY CONGRUENCES

First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009